Pashchenko Dmitriy Vladimirovich, Doctor of engineering sciences, professor, head of sub-department of computer engineering, Penza State University (40 Krasnaya street, Penza, Russia), firstname.lastname@example.org
Trokoz Dmitriy Anatol'evich, Candidate of engineering sciences, associate professor, sub-department of computer engineering, Penza State University (40 Krasnaya street, Penza, Russia), email@example.com
Sovetkina Galina Ivanovna, Master’s degree student, Penza State University (40 Krasnaya street, Penza, Russia), firstname.lastname@example.org
Nikolaeva Ekaterina Andreevna, Master’s degree student, Penza State University (40 Krasnaya street, Penza, Russia), email@example.com
Background. This article emphasizes the effectiveness and relevance of using the apparatus of Petri nets for modeling of complex computing systems. Due to the fact that the analysis methods existing in this theory do not allow estimating the resources, required to build the desired model of the system - there is a problem of criteria shortage for its evaluation in terms of the complexity of the construction.
Materials and methods. In the article we consider the method of analysis of a random Petri net based on the complexity of its building and relationships of internal units - subnets. The goal of this article is a software implementation of such an assessment within the theory of PN structures. Due to the fact, that the structural approach allows to perform the operation of decomposition of the original system, this model can be divided into subnets of minimal dimension, that will allow to make its quantitative assessment - ranking. To determine the total assessment of the input and output data of the system we perform the analysis of head and tail positions of the net taking into account the weights of the input and output arcs of these positions. In order to identify an extent of the cost required to build the system, we calculate the number of union operations of subnet transitions and positions. These subnets have the minimal dimension in the original PN.
Results. The formal implementation of assessment technique modules using algebra of sets has made is possible to formulate the rules of splitting the PN structure into elementary blocks. The example of a comparative assessment of two Petri nets based on the proposed complexity criteria is given; the plots of PN in different coordinate systems are displayed.
Conclusions. The article presents the results of the research - a plot of PN structures in three-dimensional space, implemented using the described software. It demonstrates the accuracy of PN assessment by structural analysis in comparison with a non-automated visual one. This approach can be applied for comparative assessment of computer systems in terms of complexity of their construction and sizes of input and output data.
1. Kulagin V. P. Automatic Control and Computer Sciences. New York, 1989, pp. 55–61.
2. Bollobas B. Modern graph theory. New York: Springer Science & Business Media, 1998, p. 396.
3. Straubing H. Finite automata, formal logic, and circuit complexity. Berlin: Springer Science & Business Media, 1994, p. 237.
4. Agerwala T. Computer. 1979, vol. 12 (12), pp. 85–94.
5. Agerwala T., Flynn M. ACM SIGARCH Computer Architecture News. 1973, vol. 2 (4), pp. 81–86.
6. Pashchenko D., Trokoz D., Konnov N., Sinev M. Procedia Computer Science. 2015, vol. 49, pp. 99–103.
7. Zaitsev D. A. Systems Research and Information Technologies. Kyiv, 2012, no. 2, pp. 26–41.
8. Jensen K., Rozenberg G. High-level Petri nets: theory and application. New York: Springer Science & Business Media, 1987, p. 724.
9. Tarantsev E. K. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Tekhnicheskie nauki [University proceedings. Volga region. Engineering sciences]. 2011, no. 1 (17), pp. 70–78.
10. Zaitsev D. A. Cybernetics and Systems Analysis. 2004, vol. 42 (1), pp. 126–136.
11. Hackbusch W. Tensor spaces and numerical tensor calculus. New York: Springer Science & Business Media, 2012, p. 525.
12. McConnell A. J. Applications of tensor analysis. New York: Courier Corporation, 2014, p. 315.